Motzkin subposets and Motzkin geodesics in Tamari lattices

نویسندگان

  • Jean-Luc Baril
  • Jean Marcel Pallo
چکیده

The Tamari lattice of order n can be defined by the set Dn of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin words in this structure. This distance can also be interpreted as the length of a geodesic between these Motzkin words in a Tamari lattice. So, a new upper bound is obtained for the classical rotation distance between two Motzkin words in a Tamari lattice. For some specific pairs of Motzkin words, this bound is exactly the value of the rotation distance in a Tamari lattice. Finally, enumerating results are given for join and meet irreducible elements, minimal elements and coverings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Motzkin filter in the Tamari lattice

The Tamari lattice of order n can be defined on the set Tn of binary trees endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we restrict our attention to the subset Mn of Motzkin trees. This set appears as a filter of the Tamari lattice. We prove that its diameter is 2n − 5 and that its radius is n − 2. Enumeration results are given for jo...

متن کامل

Enumeration of edges in some lattices of paths

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schröder and Grand Schröder lattices. Finally, we give a general formula for the number of edges in an arbitrary Young lattice (which can be interpreted in a natural way as a lattice of paths). 1 Pa...

متن کامل

Motzkin Paths, Motzkin Polynomials and Recurrence Relations

We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials)...

متن کامل

Lattices of Paths: Representation Theory and Valuations

We study some distributive lattices arising in the combinatorics of lattice paths. In particular, for the Dyck, Motzkin and Schröder lattices we describe the spectrum and we determine explicitly the Euler characteristic in terms of natural parameters of lattice paths. AMS Classification: Primary: 06D05; Secondary: 06A07.

متن کامل

O ct 2 00 6 RESTRICTED MOTZKIN PERMUTATIONS , MOTZKIN PATHS , CONTINUED FRACTIONS , AND CHEBYSHEV POLYNOMIALS

We say that a permutation π is a Motzkin permutation if it avoids 132 and there do not exist a < b such that π a < π b < π b+1. We study the distribution of several statistics in Motzkin permutations, including the length of the longest increasing and decreasing subsequences and the number of rises and descents. We also enumerate Motzkin permutations with additional restrictions, and study the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 114  شماره 

صفحات  -

تاریخ انتشار 2014